On the diameter of Kneser graphs
نویسندگان
چکیده
Let n and k be positive integers. The Kneser graph K n is the graph with vertex set [2n+k] and where two n-subsets A, B ∈ [2n+k] are joined by an edge if A∩B = ∅. In this note we show that the diameter of the Kneser graph K n is equal to d k e+1.
منابع مشابه
On the diameter of generalized Kneser graphs
Let r , k be positive integers, s(< r), a nonnegative integer, and n=2r−s+k. The set of r-subsets of [n]={1, 2, . . . , n} is denoted by [n]r . The generalized Kneser graphK(n, r, s) is the graph whose vertex-set is [n]r where two r-subsets A and B are joined by an edge if |A ∩ B| s. This note determines the diameter of generalized Kneser graphs. More precisely, the diameter of K(n, r, s) is eq...
متن کاملFamilies of strongly projective graphs
We give several characterisations of strongly projective graphs which generalise in many respects odd cycles and complete graphs [7]. We prove that all known families of projective graphs contain only strongly projective graphs, including complete graphs, odd cycles, Kneser graphs and non-bipartite distance-transitive graphs of diameter d ≥ 3.
متن کاملBipartite Kneser Graphs are Hamiltonian
The Kneser graph K(n, k) has as vertices all k-element subsets of [n] := {1, 2, . . . , n} and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph H(n, k) has as vertices all k-element and (n−k)-element subsets of [n] and an edge between any two vertices where one is a subset of the other. It has long been conjectured that all connected Kneser graphs and bipar...
متن کاملSymmetries of the Stable Kneser Graphs
It is well known that the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters. For n ≥ 2k + 1, k ≥ 2, we prove that the automorphism group of the stable Kneser graph SGn,k is the dihedral group of order 2n. Let [n] := [1, 2, 3, . . . , n]. For each n ≥ 2k, n, k ∈ {1, 2, 3, . . .}, the Kneser graph KGn,k has as vertices the k-subsets of [n] with edges defined by disj...
متن کاملShifts of the stable Kneser graphs and hom-idempotence
A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n, k) are not weakly hom-idempotent for n ≥ 2k + 1, k ≥ 2. For s ≥ 2, we characterize all the shifts (i.e., automorphisms of the graph that map every vertex to one of its neighbors) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 305 شماره
صفحات -
تاریخ انتشار 2005